Reasoning with Inconsistent Information

نویسنده

  • Paul Wong
چکیده

In this thesis we are concerned with developing formal and representational mechanisms for reasoning with inconsistent information. Strictly speaking there are two conceptually distinct senses in which we are interested in reasoning with inconsistent information. In one sense, we are interested in using logical deduction to draw inferences in a symbolic system. More specifically, we are interested in mechanisms that can continue to perform deduction in a reasonable manner despite the threat of inconsistencies as a direct result of errors or misrepresentations. So in this sense we are interested in inconsistency-tolerant or paraconsistent deduction. However, not every case of inconsistent description is a case of misrepresentation. In many practical situations, logically inconsistent descriptions may be deployed as representations for problems that are inherently conflicting. The issue of error or misrepresentation is irrelevant in these cases. Rather the main concern in these cases is to provide meaningful analyses of the underlying structure and properties of our logical representation which in turn informs us about the salient features of the problem under consideration. So in this second sense, we are interested in deploying logic as a representation to model situations involving conflict. In this thesis we adopt a novel framework to unify both logic-as-deduction and logic-as-representation approaches to reasoning with inconsistent information. From a preservational view point, we take deduction as a process by which metalogical properties are preserved from premises to conclusions. Thus methodologically wemay begin by identifying inconsistency-tolerant deduction mechanisms and then investigate what additional properties of inconsistent premises are preserved by these mechanisms; or alternatively we may begin by identifying properties of inconsistent logical descriptions and investigate which deductive mechanisms can preserve these properties. We view these as two aspects of the same investigation. A key assumption in this work is that adequate analyses of inconsistencies require provisions to quantitatively measure and compare inconsistent logical representations. While paraconsistent logics have enjoyed considerable success in recent years, proper quantitative analysis of inconsistencies seems to have lapsed behind to some extent. In this thesis we’ll explore different ways in which we can compare and measure inconsistencies. We hope

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method of Contrastive Reasoning with Inconsistent Ontologies

Contrastive reasoning is the reasoning with contrasts which are expressed as contrary conjunctions like the word ”but” in natural language. Contrastive answers are more informative for reasoning with inconsistent ontologies, as compared with the usual simple Boolean answer, i.e., either ”yes” or ”no”. In this paper, we propose a method of computing contrastive answers from inconsistent ontologi...

متن کامل

Contrastive Reasoning for the Semantic Web

The sentences “but” are used frequently in natural languages. However, the semantics of “but” has not yet been well studied in logic and reasoning. Contrastive reasoning is the reasoning with contrasts which are expressed as contrary conjunctions like the word ”but” in natural language. Contrastive answers are more informative for reasoning with inconsistent ontologies, as compared with the usu...

متن کامل

A paraconsistent logic programming approach for querying inconsistent databases

When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. A paraconsistent approach for knowledge base integration allows keeping inconsistent information and reasoning in its presence. In this paper, we use a paraconsistent logic (LFI1) as the underlying logic for the specification of P-Datalog, a deductive query language for ...

متن کامل

Reasoning with Uncertain and Inconsistent OWL Ontologies

Reasoning with uncertainty and inconsistency in description logics are two important issues in the development of description logicbased ontology engineering. When constructing ontologies, one may obtain ontologies that are inconsistent and are pervaded with uncertain information, such as confidence values. In this paper, we propose some approaches to reasoning with inconsistent and uncertain o...

متن کامل

Reasoning with Inconsistent Ontologies

In this paper we present a framework of reasoning with inconsistent ontologies, in which pre-defined selection functions are used to deal with concept relevance. We examine how the notion of ”concept relevance” can be used for reasoning with inconsistent ontologies. We have implemented a prototype called PION (Processing Inconsistent ONtologies), which is based on a syntactic relevance-based se...

متن کامل

Minimally inconsistent reasoning in Semantic Web

Reasoning with inconsistencies is an important issue for Semantic Web as imperfect information is unavoidable in real applications. For this, different paraconsistent approaches, due to their capacity to draw as nontrivial conclusions by tolerating inconsistencies, have been proposed to reason with inconsistent description logic knowledge bases. However, existing paraconsistent approaches are o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005